Strategic divide and choose

نویسندگان

  • Antonio Nicolò
  • Yan Yu
چکیده

We consider the classic cake-divison problem when the cake is a heterogeneous good represented by an interval in the real line. We provide a mechanism to implement, in an anonymous way, an envy-free and e¢cient allocation when agents have private information on their preferences. The mechanism is a multistep sequential game form in which each agent at each step receives a morsel of the cake that is the intersection of what she asks for herself and what the other agent concedes to her.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Equilibria of Generalized Cut and Choose Protocols

Classic cake cutting protocols — which fairly allocate a divisible good among agents with heterogeneous preferences — are susceptible to manipulation. Do their strategic outcomes still guarantee fairness? We model the interaction among agents as a game and study its Nash equilibria. We show that each protocol in the novel class of generalized cut and choose protocols — which includes the most i...

متن کامل

The costs and benefits of symmetry in common-ownership allocation problems

In experimental partnership dissolution problems with complete information, the divide-and-choose mechanism is significantly superior to the winner’s-bid auction. The performance of divide-and-choose is mainly affected by reciprocity issues and not by bounded rationality. The performance of the winner’s-bid auction is significantly affected by bounded rationality. Contrary to theoretical predic...

متن کامل

An Algorithmic Framework for Strategic Fair Division

We study the paradigmatic fair division problem of fairly allocating a divisible good among agents with heterogeneous preferences, commonly known as cake cutting. Classic cake cutting protocols are susceptible to manipulation. Do their strategic outcomes still guarantee fairness? To address this question we adopt a novel algorithmic approach, proposing a concrete computational model and reasoni...

متن کامل

An Algorithmic Framework for Strategic Fair Divisio

We study the paradigmatic fair division problem of fairly allocating a divisible good among agents with heterogeneous preferences, commonly known as cake cutting. Classic cake cutting protocols are susceptible to manipulation. Do their strategic outcomes still guarantee fairness? To address this question we adopt a novel algorithmic approach, proposing a concrete computational model and reasoni...

متن کامل

How to Divide the Possession of a Football?

In an National Football League overtime, a coin is tossed to determine which team will receive the kick off. In the sudden death format starting on offense has a significantly higher chance of winning. We examine two proposals to improve the ex post fairness: auctions and divide-and-choose. We find the auction to provide a better outcome than the divide-and-choose rule in general when the teams...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Games and Economic Behavior

دوره 64  شماره 

صفحات  -

تاریخ انتشار 2008